Determines whether a given key is found in the dictionary.

Convert this collection of items by applying a delegate to each item in the collection. The resulting enumeration contains the result of applying converter to each item in this collection, in order.

Copies all the items in the collection into an array. Implemented by using the enumerator returned from GetEnumerator to get all the items and copy them to the provided array.

Counts the number of items in the collection that satisfy the condition defined by predicate.

Determines whether the specified Object is equal to the current Object.

Determines if the collection contains any item that satisfies the condition defined by predicate.

Enumerates the items in the collection that satisfy the condition defined by predicate.

Performs the specified action on each item in this collection.

Enumerate all the keys in the dictionary, and for each key, the collection of values for that key.

Serves as a hash function for a particular type. GetHashCode()() is suitable for use in hashing algorithms and data structures like a hash table.

Gets the Type of the current instance.

Creates an array of the correct size, and copies all the items in the collection into the array, by calling CopyTo.

Shows the string representation of the dictionary. The string representation contains a list of the mappings in the dictionary.

Determines if all of the items in the collection satisfy the condition defined by predicate.

Gets a total count of values in the collection. This default implementation is slow; it enumerates all of the keys in the dictionary and calls CountValues on each. A derived class may be able to supply a more efficient implementation.

Gets a count of the number of values associated with a key. The default implementation is slow; it enumerators all of the values (using TryEnumerateValuesForKey) to count them. A derived class may be able to supply a more efficient implementation.

Enumerate all the keys in the dictionary. This method must be overridden by a derived class.

If the derived class does not use the default comparison for values, this methods should be overridden to compare two values for equality. This is used for the correct implementation of ICollection.Contains on the Values and KeyValuePairs collections.

Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.

Creates a shallow copy of the current Object.

Enumerate all of the values associated with a given key. This method must be overridden by the derived class. If the key exists and has values associated with it, an enumerator for those values is returned throught values. If the key does not exist, false is returned.

Gets the number of keys in the dictionary. This property must be overridden in the derived class.

Returns a collection of all of the values in the dictionary associated with key. If the key is not present in the dictionary, an ICollection with no values is returned. The returned ICollection is read-only.

Gets a read-only collection all the keys in this dictionary.

Gets a read-only collection of all key-value pairs in the dictionary. If a key has multiple values associated with it, then a key-value pair is present for each value associated with the key.

Gets a read-only collection of all the values in the dictionary.

Copies all the items in the collection into an array. Implemented by using the enumerator returned from GetEnumerator to get all the items and copy them to the provided array.

Indicates whether the collection is synchronized.

Indicates the synchronization object for this collection.

Provides an IEnumerator that can be used to iterate all the members of the collection. This implementation uses the IEnumerator<T> that was overridden by the derived classes to enumerate the members of the collection.